On Closure Properties of GapL
نویسندگان
چکیده
We show necessary and sufficient conditions that certain algebraic functions like the rank or the inertia of an integer matrix can be computed in GapL.
منابع مشابه
Arithmetic Complexity, Kleene Closure, and Formal Power Series
The aim of this paper is to use formal power series techniques to study the structure of small arithmetic complexity classes such as GapNC and GapL. More precisely, we apply the Kleene closure of languages and the formal power series operations of inversion and root extraction to these complexity classes. We define a counting version of Kleene closure and show that it is intimately related to i...
متن کاملThe complexity of the characteristic and the minimal polynomial
We investigate the complexity of 1) computing the characteristic polynomial, the minimal polynomial, and all the invariant factors of an integer matrix, and of 2) verifying them, when the coefficients are given as input. It is known that each coefficient of the characteristic polynomial of a matrix A is computable in GapL, and the constant term, the determinant of A, is complete for GapL. We sh...
متن کاملTopics on the Ratliff-Rush Closure of an Ideal
Introduction Let be a Noetherian ring with unity and be a regular ideal of , that is, contains a nonzerodivisor. Let . Then . The :union: of this family, , is an interesting ideal first studied by Ratliff and Rush in [15]. The Ratliff-Rush closure of is defined by . A regular ideal for which is called Ratliff-Rush ideal. The present paper, reviews some of the known prop...
متن کاملLinear v{C}ech closure spaces
In this paper, we introduce the concept of linear v{C}ech closure spaces and establish the properties of open sets in linear v{C}ech closure spaces (Lv{C}CS). Here, we observe that the concept of linearity is preserved by semi-open sets, g-semi open sets, $gamma$-open sets, sgc-dense sets and compact sets in Lv{C}CS. We also discuss the concept of relative v{C}ech closure operator, meet and pro...
متن کاملA Combinatorial Algorithm for Pfaffians
The Pfaffian of an oriented graph is closely linked to Perfect Matching. It is also naturally related to the determinant of an appropriately defined matrix. This relation between Pfaffian and determinant is usually exploited to give a fast algorithm for computing Pfaffians. We present the first completely combinatorial algorithm for computing the Pfaffian in polynomial time. Our algorithm works...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2004